Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations

It is shown that the vertices of benzenoid systems admit a labeling which reflects their distance relations. To every vertex of a molecular graph of a benzenoid hydrocarbon a sequence of zeros and ones (a binary number) can be associated, such that the number of positions in which these sequences differ is equal to the graph-theoretic vertex distance. It is shown by an example that such labelin...

متن کامل

Edge-Szeged and vertex-PIindices of Some Benzenoid Systems

The edge version of Szeged index and vertex version of PI index are defined very recently. They are similar to edge-PI and vertex-Szeged indices, respectively. The different versions of Szeged and PIindices are the most important topological indices defined in Chemistry. In this paper, we compute the edge-Szeged and vertex-PIindices of some important classes of benzenoid systems.

متن کامل

Vertex Equitable Labeling of Double Alternate Snake Graphs

Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...

متن کامل

Vertex-degree-based molecular structure descriptors of benzenoid systems and phenylenes

1031 Vertex-degree-based molecular structure descriptors of benzenoid systems and phenylenes IVAN GUTMAN* and BORIS FURTULA** Faculty of Science, University of Kragujevac, P. O. Box 60, 34000 Kragujevac, Serbia (Received 12 December 2011) Abstract. Several recently published papers report expressions for various vertex-degree-based molecular structure descriptors of benzenoid systems and phenyl...

متن کامل

Labeling the vertex amalgamation of graphs

A graph G of size q is graceful if there exists an injective function f : V (G) → {0, 1, . . . , q} such that each edge uv of G is labeled |f(u)− f(v)| and the resulting edge labels are distinct. Also, a (p, q) graph G with q ≥ p is harmonious if there exists an injective function f : V (G) → Zq such that each edge uv of G is labeled f(u)+f(v) (mod q) and the resulting edge labels are distinct,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Chemical Information and Computer Sciences

سال: 1995

ISSN: 0095-2338

DOI: 10.1021/ci00025a030